How to beat the sphere-packing bound with feedback
نویسنده
چکیده
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless feedback is allowed from the decoder to the encoder. To beat the bound, the problem must be changed. While it has long been known that variable-length block codes can do better when trading-off error probability with expected block-length, this correspondence shows that the fixed-delay setting also presents such an opportunity for generic channels. While Esp(R) continues to bound the tradeoff between bit error and fixed end-to-end latency for symmetric channels used without feedback, a new bound called the “focusing bound” gives the limits on what can be done with feedback. If low-rate reliable flow-control is free (ie. the noisy channel has strictly positive zero-error capacity), then the focusing bound can be asymptotically achieved. Even when the channel has no zero-error capacity, it is possible to substantially beat the sphere-packing bound by synthesizing an appropriately reliable channel to carry the flow-control information.
منابع مشابه
Why block length and delay behave differently if feedback is present Anant
For output-symmetric DMCs at even moderately high rates, fixed-block-length communication systems show no improvements in their error exponents with feedback. In this paper, we study systems with fixed end-to-end delay and show that feedback generally provides dramatic gains in the error exponents. A new upper bound (the uncertainty-focusing bound) is given on the probability of symbol error in...
متن کاملThe Sphere Packing Bound via Augustin's Method
The channel coding problem is reviewed for an abstract framework. If the scaled Renyi capacities of a sequence of channels converge to a finite continuous function φ on an interval of the form (1− ε, 1] for an ε > 0, then the capacity of the sequence of channels is φ(1). If the convergence holds on an interval of the form (1 − ε, 1 + ε) then the strong converse holds. Both hypotheses hold for l...
متن کاملThe impact of causality on information-theoretic source and channel coding problems
The impact of causality on information-theoretic source and channel coding problems by Harikrishna R. Palaiyanur Doctor of Philosophy in Engineering — Electrical Engineering and Computer Sciences University of California, Berkeley Professor Anant Sahai, Chair This thesis studies several problems in information theory where the notion of causality comes into play. Causality in information theory...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملA New Upper Bound on the Average Error Exponent for Multiple-Access Channels
A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by Haroutunian. However, since explicitly imposes independence of the users’ input distributions (conditioned on the time-sharing auxiliary variable) results in a ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0610139 شماره
صفحات -
تاریخ انتشار 2006